Self Reliability based Weighted Bit-Flipping Decoding for Low-density Parity-check Codes

نویسندگان

  • JIN SHA
  • MINGLUN GAO
  • ZHONGJIN ZHANG
  • LI
  • ZHONGFENG WANG
چکیده

Low Density Parity Check (LDPC) codes can be decoded in various ways, namely the Bit-Flipping (BF) algorithm, the Weighted BF algorithm (WBF), the Belief Propagation (BP) algorithm and so on. These algorithms provide a wide range of tradeoffs among decoding complexity, decoding speed, and error rate performance. In this paper, a novel self-reliability-based weighted bit-flipping decoding scheme for low-density parity-check codes is proposed. Improvement in performance is observed in comparison with the modified weighted bit-flipping decoding scheme, and the decoding complexity can be significantly reduced as well. Key-Words: Low-density parity-check (LDPC) codes, decoding algorithm, bit flipping, self reliability

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Search Based Weighted Multi-Bit Flipping Algorithm for High-Performance Low-Complexity Decoding of LDPC Codes

In this paper, two new hybrid algorithms are proposed for decoding Low Density Parity Check (LDPC) codes. Original version of the proposed algorithms named Search Based Weighted Multi Bit Flipping (SWMBF). The main idea of these algorithms is flipping variable multi bits in each iteration, change in which leads to the syndrome vector with least hamming weight. To achieve this, the proposed algo...

متن کامل

Search Based Weighted Multi-Bit Flipping Algorithm for High-Performance Low-Complexity Decoding of LDPC Codes

In this paper, two new hybrid algorithms are proposed for decoding Low Density Parity Check (LDPC) codes. Original version of the proposed algorithms named Search Based Weighted Multi Bit Flipping (SWMBF). The main idea of these algorithms is flipping variable multi bits in each iteration, change in which leads to the syndrome vector with least hamming weight. To achieve this, the proposed algo...

متن کامل

A List Decoding Algorithm for Short Low-Density Parity- Check Codes

In this paper, a list decoding algorithm for lowdensity parity-check (LDPC) codes is presented. The algorithm uses a modification of the simple Gallager bit-flipping algorithm to generate a sequence of candidate codewords iteratively one at a time using a set of test error patterns based on the reliability information of the received symbols. It is particularly efficient for short block LDPC co...

متن کامل

Modified Multi-bit Flipping Decoding Algorithm for Low-density Parity-check Codes

Aiming at seeking a low complexity decoder of the low-density parity-check (LDPC) codes, we present one modified multi-bit flipping (MMBF) algorithm. For those LDPC codes whose parity check matrices have light column weight, both the bootstrap step and a novel delay-handling step are included in MMBF, based on one framework which is the combination of conventional PWBF and IWBF. On the other ha...

متن کامل

Design of Enhanced Multi-bit Threshold Bit Flipping Algorithm for Low Complex Ldpc Decoders

Communication is transfer of information from source to sink or sender to receiver. The signal when transferred through the noisy channel gets affected by the noise and becomes an error signal when it reaches the receiver. Decoding is the process of retrieving the correct information from the received signal. The weighted bit flipping LDPC decoding algorithm gives a good performance in retrievi...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2006